Outerspatial 2-Complexes: Extending the Class of Outerplanar Graphs to Three Dimensions
نویسندگان
چکیده
We introduce the class of outerspatial 2-complexes as natural generalisation outerplanar graphs to three dimensions. Answering a question O-joung Kwon, we prove that locally 2-connected 2-complex is if and only it does not contain surface positive genus subcomplex have space minor generalised cone over $K_4$ or $K_{2,3}$.
 This applied nested plane embeddings graphs; is, constrained by conditions placed on set cycles graph.
منابع مشابه
Labeling outerplanar graphs with maximum degree three
An L(2, 1)-labeling of a graph G is an assignment of a nonnegative integer to each vertex of G such that adjacent vertices receive integers that differ by at least two and vertices at distance two receive distinct integers. The span of such a labeling is the difference between the largest and smallest integers used. The λ-number of G, denoted by λ(G), is the minimum span over all L(2, 1)-labeli...
متن کاملDrawing outerplanar graphs using three edge lengths
It is shown that for any outerplanar graph G there is a one to one mapping of the vertices of G to the plane, so that the number of distinct distances between pairs of connected vertices is at most three. This settles a problem of Carmi, Dujmović, Morin and Wood. The proof combines (elementary) geometric, combinatorial, algebraic and probabilistic arguments.
متن کاملQTC3D: Extending the Qualitative Trajectory Calculus to Three Dimensions
Spatial interactions between agents (humans, animals, or machines) carry information of high value to human or electronic observers. However, not all the information contained in a pair of continuous trajectories is important and thus the need for qualitative descriptions of interaction trajectories arises. The Qualitative Trajectory Calculus (QTC) (Van de Weghe, 2004) is a promising developmen...
متن کاملPathwidth of outerplanar graphs
We are interested in the relation between the pathwidth of a biconnected outerplanar graph and the pathwidth of its (geometric) dual. Bodlaender and Fomin [2], after having proved that the pathwidth of every biconnected outerplanar graph is always at most twice the pathwidth of its (geometric) dual plus two, conjectured that there exists a constant c such that the pathwidth of every biconnected...
متن کاملExtending phase field models of grain boundaries to three dimensions
There have been a number of approaches to the modeling of grain boundaries, all of which have limitations and advantages. Of particular interest are phase field models, which have gained popularity as their ability to compute realistic microstructures has been demonstrated. For an overview of this approach, the reader is recommended some of the review articles on this topic. [1] A basic model o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Combinatorics
سال: 2023
ISSN: ['1077-8926', '1097-1440']
DOI: https://doi.org/10.37236/10539